Skeleton simplicial evaluation codes
نویسندگان
چکیده
For a subspace arrangement over a finite field we study the evaluation code defined on the arrangements set of points. The length of this code is given by the subspace arrangements characteristic polynomial. For coordinate subspace arrangements the dimension is bounded below by the face vector of the corresponding simplicial complex. The minimum distance is determined for coordinate subspace arrangements where the simplicial complex is a skeleton.
منابع مشابه
Chromatic Polynomials of Simplicial Complexes
In this note we consider s-chromatic polynomials for finite simplicial complexes. When s = 1, the 1-chromatic polynomial is just the usual graph chromatic polynomial of the 1-skeleton. In general, the s-chromatic polynomial depends on the s-skeleton and its value at r is the number of (r, s)-colorings of the simplicial complex.
متن کاملMixing in High-Dimensional Expanders
We establish a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to as mixing, or pseudorandomness). Recently, an analogue of this Lemma was proved for simplicial complexes of arbitrary dimension, provided that the skeleto...
متن کاملOn simplicial and cubical complexes with short links
We consider closed simplicial and cubical n-complexes in terms of link of their (n−2)faces. Especially, we consider the case, when this link has size 3 or 4, i.e., every (n − 2)face is contained in 3 or 4 n-faces. Such simplicial complexes with short (i.e. of length 3 or 4) links are completely classified by their characteristic partition. We consider also embedding into hypercubes of the skele...
متن کاملFinite Free Resolutions and 1-Skeletons of Simplicial Complexes
A technique of minimal free resolutions of Stanley–Reisner rings enables us to show the following two results: (1) The 1-skeleton of a simplicial (d − 1)-sphere is d-connected, which was first proved by Barnette; (2) The comparability graph of a non-planar distributive lattice of rank d − 1 is d-connected.
متن کاملDirac’s Theorem on Simplicial Matroids
We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higherdimensional analogue of clique (or flag) complexes (case k = 2) and they are a rich new class of simplicial complexes. We show that Dirac’s theorem on chordal graphs has a higher-dimensional analogue in which graphs and clique ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 72 شماره
صفحات -
تاریخ انتشار 2014